PARALLEL MACHINE SCHEDULING WITH MONTE CARLO TREE SEARCH

In this article, a specific production scheduling problem (PSP), the Parallel Machine Scheduling Problem (PMSP) with Job and Sequence Setup Times, Due Dates Maintenance Times is presented. article after introduction literature review mathematical model of Machines After that Monte Carlo Tree Search Simulated Annealing are detailed. Our representation technique its evaluation also introduced. that, efficiency algorithms tested benchmark data, which result, suitable for solving problems. review, The solved (MCTS) algorithm, uses neighbourhood search method (2-opt). we present our Iterative (IMCTS) algorithm on randomly generated datasets.